Parallelizing Combinatorial Optimization Heuristics with GPUs
نویسندگان
چکیده
منابع مشابه
HEURISTICS FOR COMBINATORIAL OPTIMIZATION Lecture 3 Metaheuristics for Construction Heuristics
Task: Pack all the items into a minimum number of unit-capacity bins An algorithm A is said to be a δ-approximation algorithm if it runs in polynomial time and for every problem instance π with optimal solution value OP T (π) minimization: A(π) OP T (π) ≤ δ δ ≥ 1 maximization: A(π) OP T (π) ≥ δ δ ≤ 1 A family of approximation algorithms for a problem Π, {A } , is called a polynomial approximati...
متن کاملOptimization Heuristics for the Combinatorial Auction Problem
This paper presents and compares three heuristics for the combinatorial auction problem. Besides a simple greedy (SG) mechanism, two metaheuristics, a simulated annealing (SA), and a genetic algorithm (GA) approach are developed which use the combinatorial auction process to find an allocation with maximal revenue for the auctioneer. The performance of these three heuristics is evaluated in the...
متن کاملGeneric Heuristics for Combinatorial Optimization Problems
This paper discusses the use of several heuristic techniques for problems of combinatorial optimization. We especially consider the advantages and disadvantages of naturally inspired generic techniques like Simulated Annealing, Evolution Strategies, or Genetic Algorithms. This reflection gives a quite intuitive motivation for hybrid approaches that aim to combine advantageous aspects of the cer...
متن کاملTeaching Modern Heuristics in Combinatorial Optimization
The article describes the proposition and implementation of a demonstration, learning and decision support system for the resolution of combinatorial optimization problems under multiple objectives. The system brings together two key aspects of higher education: research and teaching. It allows the user to define modern metaheuristics and test their resolution behavior on machine scheduling pro...
متن کاملDM 63 - Heuristics for Combinatorial Optimization Weekly
We discussed how to use tools from exploratory data analysis of statistics to visualize experimental results. We used the data collected from the Task 1 of the Implementation Contest. In the comparison there were three extra participants (ROS: Random Ordered Sequence greedy coloring, DSATUR, The degree of saturation and RLF, Recursive Large First). RLF and DSATUR clearly outperformed the other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Science, Technology and Engineering Systems Journal
سال: 2018
ISSN: 2415-6698,2415-6698
DOI: 10.25046/aj030635